tiny-queue
A simple FIFO queue implementation to avoid having to do shift()
on an array, which is slow. It's implemented in the straightforward root -> node1 -> node2 -> etc.
architecture that we all remember from CS 101.
This can typically be used as a drop-in replacement for an array, and it's only 38 lines of code.
Status
![browser support](https://ci.testling.com/nolanlawson/tiny-queue.png)
Usage
npm install tiny-queue
Then:
var Queue = require('tiny-queue');
var queue = new Queue();
queue.push('foo');
queue.push('bar');
queue.shift();
queue.shift();
queue.length;
queue.shift();
API
The returned Queue
object, once instantiated, only supports
four operations:
queue.push()
queue.shift()
queue.slice()
queue.length
So it's basically a drop-in replacement for most naïve usages
of an array as a queue.